Improved PSO-based Static RWA Solver Avoiding Premature Convergence
نویسندگان
چکیده
In this paper an improved Particle Swarm Optimization (PSO) scheme is proposed to solve Static Routing and Wavelength Assignment (static RWA) where the movement of the swarm particles is influenced by their personal-best position searched so far and the position of the global-best particle. Simulation results show that the proposed scheme performs better in terms of particle fitness value and average path length of the computed routes as compared to previous work. This is achieved by avoiding premature convergence of the particles in the swarm.
منابع مشابه
Optimization Using Particle Swarms with Near Neighbor Interactions
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. In the new algorithm, each particle is attracted towards the best previous positions visited by its neighbors, in addition to the other aspects of particle dynamics in PSO. This is accomplished by using the ratio of t...
متن کاملFitness-distance-ratio based particle swarm optimization
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards nearby particles of higher fitness, instead of attracting each particle towards just the best position discovered so far by any particle. This is accomplished by usin...
متن کاملAn Orthogonal Multi-Swarm Cooperative PSO Algorithm with a Particle Trajectory Knowledge Base
A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO) algorithm with a particle trajectory knowledge base is presented in this paper. Different from the traditional PSO algorithms and other variants of PSO, the proposed orthogonal multi-swarm cooperative PSO algorithm not only introduces an orthogonal initialization mechanism and a particle trajectory knowledge base for m...
متن کاملFitness-Distance-Ratio Based Particle Swarm Optiniization
This paper presents a modification of tlte panicle swarm optimization algorithm (PSO) intended to combat the problem ofpremature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards neorby particles of higher fitness, instead of amacting each panicle towards just the best position discovered so far by any particle. This is accomplished by using th...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کامل